Quantum-error-correction benchmarks for continuous weak-parity measurements

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous quantum error correction

We describe new implementations of quantum error correction that are continuous in time, and thus described by continuous dynamical maps. We evaluate the performance of such schemes using numerical simulations, and comment on the effectiveness and applicability of continuous error correction for quantum computing.

متن کامل

Error Correction for Continuous Quantum Variables

Quantum computers hold the promise for efficiently factoring large integers [1]. However, to do this beyond a most modest scale they will require quantum error correction [2]. The theory of quantum error correction is already well studied in two-level or spin2 systems (in terms of qubits or quantum bits) [2–7]. Some of these results have been generalized to higher-spin systems [8–11]. This work...

متن کامل

Operator quantum error correction for continuous dynamics

Ognyan Oreshkov, Daniel A. Lidar, and Todd A. Brun Grup de Física Teòrica, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089, USA Department of Physics, University of Southern California, Los Angeles, California 90089, USA Department of Chemistry, Universi...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Quantum Weak Parity Problem

In this work we shall investigate quantum query complexity of weak PARITY problem. Weak Parity is the following natural query problem: What is the minimum number of queries necessary to compute PARITY(x1, x2, x3, . . . , xn) on at least 1 2 + fraction of the inputs. For randomized classical or exact quantum machines this relaxed PARITY problem remains as hard as original PARITY problem. Althoug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2012

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.86.032318